An approach to innocent strategies as graphs
نویسندگان
چکیده
منابع مشابه
An approach to innocent strategies as graphs
This paper proposes an approach for extending to graphs the close relation between proofs and innocent strategies. We work in the setting of L-nets, introduced by Faggian and Maurel as a game model of concurrent interaction. We show how L-nets satisfying an additional condition, which we call LS-nets, can be sequentialized into traditional tree-like strategies. Conversely, sequential strategies...
متن کاملInnocent strategies as presheaves and interactive equivalences for CCS
Seeking a general framework for reasoning about and comparing programming languages, we derive a new view of Milner’s CCS [33]. We construct a category E of plays, and a subcategory V of views. We argue that presheaves on V adequately represent innocent strategies, in the sense of game semantics [20]. We equip innocent strategies with a simple notion of interaction. We then prove decomposition ...
متن کاملInnocent Strategies as Presheaves and Interactive Equivalences for CCS1
Seeking a general framework for reasoning about and comparing programming languages, we derive a new view of Milner’s CCS [34]. We construct a category E of plays, and a subcategory V of views. We argue that presheaves on V adequately represent innocent strategies, in the sense of game semantics [20]. We equip innocent strategies with a simple notion of interaction. We then prove decomposition ...
متن کاملnon-corrective approach to pronunciation
the aim of this study has been to find answers for the following questions: 1. what is the effect of immediate correction on students pronunciation errors? 2. what would be the effect of teaching the more rgular patterns of english pronunciation? 3. is there any significant difference between the two methods of dealing with pronuciation errore, i. e., correction and the teaching of the regular ...
15 صفحه اولKRONECKER GRAPHS: AN APPROACH TO MODELING NETWORKS Kronecker graphs: an approach to modeling networks
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks exhibit a long list of surprising properties: Heavy tails for the inand out-degree distribution; heavy tails for the eigenvalues and eigenvectors; small diameters; and densification and shrinking diameters over time. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2012
ISSN: 0890-5401
DOI: 10.1016/j.ic.2011.12.006